TSTP Solution File: SEV134^5 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SEV134^5 : TPTP v8.1.2. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s

% Computer : n012.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Sun May  5 09:41:28 EDT 2024

% Result   : Theorem 0.22s 0.37s
% Output   : Refutation 0.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   17 (   3 unt;   5 typ;   0 def)
%            Number of atoms       :   87 (  37 equ;   0 cnn)
%            Maximal formula atoms :   10 (   7 avg)
%            Number of connectives :  125 (  22   ~;  12   |;  16   &;  62   @)
%                                         (   0 <=>;  13  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   8 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :   27 (  27   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    6 (   3 usr;   3 con; 0-2 aty)
%            Number of variables   :   44 (   0   ^  32   !;  12   ?;  44   :)

% Comments : 
%------------------------------------------------------------------------------
thf(type_def_5,type,
    a: $tType ).

thf(func_def_0,type,
    a: $tType ).

thf(func_def_4,type,
    sK0: a ).

thf(func_def_5,type,
    sK1: a > a > $o ).

thf(func_def_6,type,
    sK2: a > $o ).

thf(f14,plain,
    $false,
    inference(subsumption_resolution,[],[f11,f12]) ).

thf(f12,plain,
    ( ( sK2 @ sK0 )
    = $true ),
    inference(cnf_transformation,[],[f10]) ).

thf(f10,plain,
    ( ! [X3: a,X4: a] :
        ( ( $true
          = ( sK2 @ X3 ) )
        | ( ( sK2 @ X4 )
         != $true )
        | ( ( sK1 @ X4 @ X3 )
         != $true ) )
    & ( ( sK2 @ sK0 )
      = $true )
    & ( ( sK2 @ sK0 )
     != $true ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f8,f9]) ).

thf(f9,plain,
    ( ? [X0: a,X1: a > a > $o,X2: a > $o] :
        ( ! [X3: a,X4: a] :
            ( ( ( X2 @ X3 )
              = $true )
            | ( ( X2 @ X4 )
             != $true )
            | ( ( X1 @ X4 @ X3 )
             != $true ) )
        & ( ( X2 @ X0 )
          = $true )
        & ( ( X2 @ X0 )
         != $true ) )
   => ( ! [X4: a,X3: a] :
          ( ( $true
            = ( sK2 @ X3 ) )
          | ( ( sK2 @ X4 )
           != $true )
          | ( ( sK1 @ X4 @ X3 )
           != $true ) )
      & ( ( sK2 @ sK0 )
        = $true )
      & ( ( sK2 @ sK0 )
       != $true ) ) ),
    introduced(choice_axiom,[]) ).

thf(f8,plain,
    ? [X0: a,X1: a > a > $o,X2: a > $o] :
      ( ! [X3: a,X4: a] :
          ( ( ( X2 @ X3 )
            = $true )
          | ( ( X2 @ X4 )
           != $true )
          | ( ( X1 @ X4 @ X3 )
           != $true ) )
      & ( ( X2 @ X0 )
        = $true )
      & ( ( X2 @ X0 )
       != $true ) ),
    inference(rectify,[],[f7]) ).

thf(f7,plain,
    ? [X2: a,X1: a > a > $o,X0: a > $o] :
      ( ! [X3: a,X4: a] :
          ( ( ( X0 @ X3 )
            = $true )
          | ( ( X0 @ X4 )
           != $true )
          | ( ( X1 @ X4 @ X3 )
           != $true ) )
      & ( ( X0 @ X2 )
        = $true )
      & ( ( X0 @ X2 )
       != $true ) ),
    inference(flattening,[],[f6]) ).

thf(f6,plain,
    ? [X2: a,X1: a > a > $o,X0: a > $o] :
      ( ( ( X0 @ X2 )
       != $true )
      & ( ( X0 @ X2 )
        = $true )
      & ! [X3: a,X4: a] :
          ( ( ( X0 @ X3 )
            = $true )
          | ( ( X1 @ X4 @ X3 )
           != $true )
          | ( ( X0 @ X4 )
           != $true ) ) ),
    inference(ennf_transformation,[],[f5]) ).

thf(f5,plain,
    ~ ! [X2: a,X1: a > a > $o,X0: a > $o] :
        ( ! [X3: a,X4: a] :
            ( ( ( ( X1 @ X4 @ X3 )
                = $true )
              & ( ( X0 @ X4 )
                = $true ) )
           => ( ( X0 @ X3 )
              = $true ) )
       => ( ( ( X0 @ X2 )
            = $true )
         => ( ( X0 @ X2 )
            = $true ) ) ),
    inference(fool_elimination,[],[f4]) ).

thf(f4,plain,
    ~ ! [X0: a > $o,X1: a > a > $o,X2: a] :
        ( ! [X3: a,X4: a] :
            ( ( ( X0 @ X4 )
              & ( X1 @ X4 @ X3 ) )
           => ( X0 @ X3 ) )
       => ( ( X0 @ X2 )
         => ( X0 @ X2 ) ) ),
    inference(rectify,[],[f2]) ).

thf(f2,negated_conjecture,
    ~ ! [X2: a > $o,X0: a > a > $o,X1: a] :
        ( ! [X4: a,X3: a] :
            ( ( ( X2 @ X3 )
              & ( X0 @ X3 @ X4 ) )
           => ( X2 @ X4 ) )
       => ( ( X2 @ X1 )
         => ( X2 @ X1 ) ) ),
    inference(negated_conjecture,[],[f1]) ).

thf(f1,conjecture,
    ! [X2: a > $o,X0: a > a > $o,X1: a] :
      ( ! [X4: a,X3: a] :
          ( ( ( X2 @ X3 )
            & ( X0 @ X3 @ X4 ) )
         => ( X2 @ X4 ) )
     => ( ( X2 @ X1 )
       => ( X2 @ X1 ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.IZyonPtPgf/Vampire---4.8_27997',cTHM201_pme) ).

thf(f11,plain,
    ( ( sK2 @ sK0 )
   != $true ),
    inference(cnf_transformation,[],[f10]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem    : SEV134^5 : TPTP v8.1.2. Released v4.0.0.
% 0.04/0.14  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.14/0.35  % Computer : n012.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Fri May  3 11:50:25 EDT 2024
% 0.14/0.35  % CPUTime    : 
% 0.14/0.35  This is a TH0_THM_NEQ_NAR problem
% 0.14/0.35  Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/tmp/tmp.IZyonPtPgf/Vampire---4.8_27997
% 0.22/0.37  % (28205)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on Vampire---4 for (3000ds/2Mi)
% 0.22/0.37  % (28205)First to succeed.
% 0.22/0.37  % (28205)Refutation found. Thanks to Tanya!
% 0.22/0.37  % SZS status Theorem for Vampire---4
% 0.22/0.37  % SZS output start Proof for Vampire---4
% See solution above
% 0.22/0.37  % (28205)------------------------------
% 0.22/0.37  % (28205)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.37  % (28205)Termination reason: Refutation
% 0.22/0.37  
% 0.22/0.37  % (28205)Memory used [KB]: 5500
% 0.22/0.37  % (28205)Time elapsed: 0.002 s
% 0.22/0.37  % (28205)Instructions burned: 1 (million)
% 0.22/0.37  % (28205)------------------------------
% 0.22/0.37  % (28205)------------------------------
% 0.22/0.37  % (28199)Success in time 0.002 s
% 0.22/0.37  % Vampire---4.8 exiting
%------------------------------------------------------------------------------